Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices
نویسندگان
چکیده
منابع مشابه
graphs with fixed number of pendent vertices and minimal first zagreb index
the first zagreb index $m_1$ of a graph $g$ is equal to the sum of squaresof degrees of the vertices of $g$. goubko proved that for trees with $n_1$pendent vertices, $m_1 geq 9,n_1-16$. we show how this result can beextended to hold for any connected graph with cyclomatic number $gamma geq 0$.in addition, graphs with $n$ vertices, $n_1$ pendent vertices, cyclomaticnumber $gamma$, and minimal $m...
متن کاملMORE GRAPHS WHOSE ENERGY EXCEEDS THE NUMBER OF VERTICES
The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of G. Several classes of graphs are known that satisfy the condition E(G) > n , where n is the number of vertices. We now show that the same property holds for (i) biregular graphs of degree a b , with q quadrangles, if q<= abn/4 and 5<=a < b = 0 (iii) triregular graphs of degree 1, a, b that are quadran...
متن کاملOn the fixed number of graphs
A set of vertices $S$ of a graph $G$ is called a fixing set of $G$, if only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing number of a graph is the smallest cardinality of a fixing set. The fixed number of a graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a fixing set of $G$. A graph $G$ is called a $k$-fixed graph, if its fix...
متن کاملThe Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges
Let c(n, q) be the number of connected labeled graphs with n vertices and q 5 N = ( ) edges. Let x = q/n and k = q n. We determine functions w k 1 , a(x ) and cp(x) such that c (n , q) w k ( z ) e n r p ( x ) e o ( x ) uniformly for all n and q 2 n. If Q > O is fixed, n+= and 4q > ( 1 + ~ ) n log n, this formula simplifies to c(n, q) ( t ) exp(-ne-zq’n). On the other hand, if k = o(n”’), this f...
متن کاملThe algebraic connectivity of graphs with given stability number
In this paper, the authors investigate the algebraic connectivity of connected graphs, and determine the graph which has the minimum algebraic connectivity among all connected graphs of order n with given stability number α ≥ d 2 e, or covering number, respectively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2010
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-010-0975-0